clustering iran earthquake data using improved ant system-based clustering algorithm (technical note)

نویسندگان

بهروز مینائی

دانشیار دانشکده مهندسی کامپیوتر- دانشگاه علم و صنعت ایران محمد فتحیان

دانشیار دانشکده مهندسی صنایع- دانشگاه علم و صنعت ایران احمدرضا جعفریان مقدم

دانشجوی دکترای دانشکده مهندسی صنایع دانشگاه علم و صنعت ایران و مدیر پروژه توسعه نرم افزار شرکت مهندسی شبکه پویش داده نوین مهدی نصیری

دانشجوی دکترای مهندسی کامپیوتر دانشگاه علم و صنعت ایران

چکیده

clustering technique is one of the most important techniques of data mining and is the branch of multivariate statistical analysis and a method for grouping similar data in to same clusters. with the databases getting bigger, the researchers try to find efficient and effective clustering methods so that they can make fast and real decisions. thus, in this paper, we proposed an improved ant system-based clustering algorithm (iasc) in order to providing the fast clusters with high accuracy. the goal of clustering analysis is to group similar objects together. there are many methods being applied in clustering analysis, like hierarchical clustering, partition-based clustering, density-based clustering, and artificial intelligence-based clustering. the ant colony system (acs) is one of the newest meta-heuristics for combinatorial optimization problems, and this study uses the ant colony system to find the clusters effectively. the iasc algorithm is including four sub-procedures, that is divide, agglomerate_obj, agglomerate, and remove. first, initialize the parameters and group all the objects as a cluster. and then the sub-procedure divide will divide the cluster into several sub-clusters and some object which does not belong to any sub-clusters through the consistency of the pheromone and some criterion. after divide, the agglomerate_obj is the next step at this algorithm in order to agglomerate the objects into the suitable sub-cluster. fourth, agglomerate is the sub-procedure to merge the similar two sub-clusters into a cluster. and then run agglomerate_obj again. sixth, after agglomerating the similar object into the suitable sub-cluster, the remove sub-procedure tries to remove the un-similar from sub-cluster. calculate the total within cluster variance (twcv). if twcv is not changed, stop the procedure. otherwise, repeat the sub-procedure divide, agglomerate_obj, agglomerate, agglomerate_obj, remove until twcv is not changed. the implementation results on the iran earthquake data show that the proposed method is able to provide more accurate and fast clusters and to determine the outliers. the computational time is also reduced.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improved opposition-based Crow Search Algorithm for Data Clustering

Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...

متن کامل

Use of the Improved Frog-Leaping Algorithm in Data Clustering

Clustering is one of the known techniques in the field of data mining where data with similar properties is within the set of categories. K-means algorithm is one the simplest clustering algorithms which have disadvantages sensitive to initial values of the clusters and converging to the local optimum. In recent years, several algorithms are provided based on evolutionary algorithms for cluster...

متن کامل

Big Data Clustering Using Grid Computing and Ant- Based Algorithm

Big data has the power to dramatically change the way institutes and organizations use their data. Transforming the massive amounts of data into knowledge will leverage the organizations performance to the maximum. Scientific and business organizations would benefit from utilizing big data. However, there are many challenges in dealing with big data such as storage, transfer, management and man...

متن کامل

Image Segmentation Using Ant System-Based Clustering Algorithm

Industrial applications of computer vision sometimes require detection of atypical objects that occur as small groups of pixels in digital images. These objects are difficult to single out because they are small and randomly distributed. In this work we propose an image segmentation method using the novel Ant System-based Clustering Algorithm (ASCA). ASCA models the foraging behaviour of ants, ...

متن کامل

use of the improved frog-leaping algorithm in data clustering

clustering is one of the known techniques in the field of data mining where data with similar properties is within the set of categories. k-means algorithm is one the simplest clustering algorithms which have disadvantages sensitive to initial values of the clusters and converging to the local optimum. in recent years, several algorithms are provided based on evolutionary algorithms for cluster...

متن کامل

Graph Partitioning Using Improved Ant Clustering

Parallel computing, network partitioning, and VLSI circuit placement are fundamental challenges in computer science. These problems can be modeled as graph partitioning problems. A new Similarity carrying Ant Model (SCAM) is used in the ant-based clustering algorithm to solve graph partitioning problem. In the proposed model, the ant will be able to collect similar items while it moves around. ...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
مهندسی صنایع

جلد ۴۵، شماره ۲، صفحات ۲۲۱-۲۲۷

کلمات کلیدی
clustering technique is one of the most important techniques of data mining and is the branch of multivariate statistical analysis and a method for grouping similar data in to same clusters. with the databases getting bigger the researchers try to find efficient and effective clustering methods so that they can make fast and real decisions. thus in this paper we proposed an improved ant system based clustering algorithm (iasc) in order to providing the fast clusters with high accuracy. the goal of clustering analysis is to group similar objects together. there are many methods being applied in clustering analysis like hierarchical clustering partition based clustering density based clustering and artificial intelligence based clustering. the ant colony system (acs) is one of the newest meta heuristics for combinatorial optimization problems and this study uses the ant colony system to find the clusters effectively. the iasc algorithm is including four sub procedures that is divide agglomerate_obj agglomerate and remove. first initialize the parameters and group all the objects as a cluster. and then the sub procedure divide will divide the cluster into several sub clusters and some object which does not belong to any sub clusters through the consistency of the pheromone and some criterion. after divide the agglomerate_obj is the next step at this algorithm in order to agglomerate the objects into the suitable sub cluster. fourth agglomerate is the sub procedure to merge the similar two sub clusters into a cluster. and then run agglomerate_obj again. sixth after agglomerating the similar object into the suitable sub cluster the remove sub procedure tries to remove the un similar from sub cluster. calculate the total within cluster variance (twcv). if twcv is not changed stop the procedure. otherwise repeat the sub procedure divide agglomerate_obj agglomerate agglomerate_obj remove until twcv is not changed. the implementation results on the iran earthquake data show that the proposed method is able to provide more accurate and fast clusters and to determine the outliers. the computational time is also reduced.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023